1 4 D ec 2 01 2 On the Maximum Number of k - Hooks of Partitions of n
نویسنده
چکیده
Abstract. Let αk(λ) denote the number of k-hooks in a partition λ and let b(n, k) be the maximum value of αk(λ) among partitions of n. Amdeberhan posed a conjecture on the generating function of b(n, 1). We give a proof of this conjecture. In general, we obtain a formula that can be used to determine b(n, k). This leads to a generating function formula for b(n, k). We introduce the notion of nearly k-triangular partitions. We show that for any n, there is a nearly k-triangular partition which can be transformed into a partition of n that attains the maximum number of k-hooks. The operations for the transformation enable us to compute the number b(n, k).
منابع مشابه
On the Maximum Number of k-Hooks of Partitions of n
Let αk(λ) denote the number of k-hooks in a partition λ and let b(n, k) be the maximum value of αk(λ) among partitions of n. Amdeberhan posed a conjecture on the generating function of b(n, 1). We give a proof of this conjecture. In general, we obtain a formula that can be used to determine b(n, k). This leads to a generating function formula for b(n, k). We introduce the notion of nearly k-tri...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملHooks and Powers of Parts in Partitions
Many textbooks contain material on partitions. Two standard references are [A] and [S]. A partition of a natural integer n with parts λ1, . . . , λk is a finite decreasing sequence λ = (λ1 ≥ λ2 ≥ · · · ≥ λk > 0) of natural integers λ1, . . . , λk > 0 such that n = ∑k i=1 λi. We denote by |λ| the content n of λ. Partitions are also written as sums: n = λ1 + · · ·+ λk and one uses also the (abusi...
متن کاملDistinguishing number and distinguishing index of natural and fractional powers of graphs
The distinguishing number (resp. index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (resp. edge labeling) with $d$ labels that is preserved only by a trivial automorphism. For any $n in mathbb{N}$, the $n$-subdivision of $G$ is a simple graph $G^{frac{1}{n}}$ which is constructed by replacing each edge of $G$ with a path of length $n$...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012